CONNECTIVITY AND EDGE-DISJOINT SPANNING TREESGUSFIELD D.1983; INFORMATION PROCESSING LETTERS; ISSN 0020-0190; NLD; DA. 1983; VOL. 16; NO 2; PP. 87-89; BIBL. 7 REF.Article

MATCHING AND SPANNING IN CERTAIN PLANAR GRAPHSCARLYLE JW; GREIBACH SA; PAZ A et al.1983; MATHEMATICAL SYSTEMS THEORY; ISSN 0025-5661; DEU; DA. 1983; VOL. 16; NO 2; PP. 159-183; BIBL. 17 REF.Article

ON THE COMPLEXICITY OF FINDING MULTI-CONSTRAINED SPANNING TREESCAMERINI PM; GALBIATI G; MAFFIOLI F et al.1983; DISCRETE APPL. MATH.; ISSN 0166-218X; NLD; DA. 1983; VOL. 5; NO 1; PP. 39-50; BIBL. 5 REF.Conference Paper

ALGORITHM FOR FINDING THE COMMON SPANNING TREES OF TWO GRAPHSGRIMBLEBY JB.1982; ELECTRONICS LETTERS; ISSN 0013-5194; GBR; DA. 1982; VOL. 18; NO 23; PP. 988-989; BIBL. 2 REF.Article

ENUMERATION OF SAPANNING TREES CONTAINING GIVEN SUBTREES.OLAH G.1975; ACTA MATH. ACAD. SCI. HUNGAR.; HONGR.; DA. 1975; VOL. 26; NO 1-2; PP. 205-207; BIBL. 11 REF.Article

A CERTAIN POLYNOMIAL OF A GRAPH AND GRAPHS WITH AN EXTREMAL NUMBER OF TREES.KELMANS AK; CHELNOKOV VM.1974; J. COMBINATOR. THEORY, B; U.S.A.; DA. 1974; VOL. 16; NO 3; PP. 197-214; BIBL. 21 REF.Article

A NOTE ON FINDING THE BRIDGES OF A GRAPH.TARJAN RE.1974; INFORM. PROCESSG LETTERS; NETHERL.; DA. 1974; VOL. 2; NO 6; PP. 160-161; BIBL. 5 REF.Article

ON ENUMERATING THE TREES OF THE WHEEL AND OTHER SPECIAL GRAPHSJOHNSON DE; JOHNSON JR.1983; JOURNAL OF THE FRANKLIN INSTITUTE; ISSN 0016-0032; USA; DA. 1983; VOL. 315; NO 2; PP. 139-148; BIBL. 7 REF.Article

ON FINDING AND UPDATING SPANNING TREES AND SHORTEST PATHS.SPIRA PM; PAN A.1975; S.I.A.M. J. COMPUTG; U.S.A.; DA. 1975; VOL. 4; NO 3; PP. 375-380; BIBL. 6 REF.Article

A PROBLEM ON SPANNING TREES.TUTTE WT.1974; QUART. J. MATH.; G.B.; DA. 1974; VOL. 25; NO 98; PP. 253-255; BIBL. 2 REF.Article

EFFICIENT ALGORITHMS FOR DETERMINING AN EXTREMAL TREE OF A GRAPH. (EXTENDED ABSTRACT.).KAMEDA T; TOIDA S.1973; IN: ANNU. SYMP. SWITCHING AUTOM. THEORY. 14; IOWA CITY; 1973; NORTHRIDGE; INST. ELECTR. ELECTRON. ENG. INC.; DA. 1973; PP. 12-15; BIBL. 8 REF.Conference Paper

ON FINDING AND UPDATING SHORTEST PATHS AND SPANNING TREES.SPIRA PM; PAN A.1973; IN: ANNU. SYMP. SWITCHING AUTOM. THEORY. 14; IOWA CITY; 1973; NORTHRIDGE; INST. ELECTR. ELECTRON. ENG. INC.; DA. 1973; PP. 82-84; BIBL. 5 REF.Conference Paper

INTERPOLATION THEOREM FOR THE NUMBER OF END-VERTICES OF SPANNING TREESSCHUSTER S.1983; JOURNAL OF GRAPH THEORY; ISSN 0364-9024; USA; DA. 1983; VOL. 7; NO 2; PP. 203-208; BIBL. 1 REF.Article

ANALYSIS OF A SPANNING TREE ENUMERATION ALGORITHMJAYAKUMAR R; THULASIRAMAN K.1981; LECT. NOTES MATH.; ISSN 0075-8434; DEU; DA. 1981; NO 885; PP. 284-289; BIBL. 5 REF.Conference Paper

ON THE GRACEFUL NUMBERING OF SPANNING TREES.CAHIT I; CAHIT R.1975; INFORM. PROCESSG LETTERS; NETHERL.; DA. 1975; VOL. 3; NO 4; PP. 115-118; BIBL. 1 REF.Article

AN O(!E!LOG LOG!V!) ALGORITHM FOR FINDING MINIMUM SPANNING TREES.CHI CHIH YAO A.1975; INFORM. PROCESSG LETTERS; NETHERL.; DA. 1975; VOL. 4; NO 1; PP. 21-23; BIBL. 6 REF.Article

MAXIMIZING THE NUMBER OF SPANNING TREES IN A GRAPH WITH N NODES AND M EDGES.SHIER DR.1974; J. RES. NATION. BUR. STAND., B; U.S.A.; DA. 1974; VOL. 78; NO 4; PP. 193-196; BIBL. 6 REF.Article

A NOTE ON LERDA AND MAROJANI'S MINIMUM CROSSING ALGORITHM.RUBIN F.1974; CALCOLO; ITAL.; DA. 1974; VOL. 11; NO 2; PP. 201-203; BIBL. 3 REF.Article

BOUNDS ON THE NUMBER OF DISJOINT SPANNING TREES.SUKHAMAY KUNDU.1974; J. COMBINATOR. THEORY, B; U.S.A.; DA. 1974; VOL. 17; NO 2; PP. 199-203; BIBL. 5 REF.Article

UBER GRAPHEN MIT ISOMORPHEN GERUESTEN = SUR UN GRAPHE A ARBRE MAXIMAL ISOMORPHEFISCHER R.1973; MONATSH. MATH.; OSTERR.; DA. 1973; VOL. 77; NO 1; PP. 24-30; BIBL. 2 REF.Serial Issue

ON THE WORST CASE OF A MINIMAL SPANNING TREE ALGORITHM FOR EUCLIDEAN SPACEKATAJAINEN J.1983; BIT (NORDISK TIDSKRIFT FOR INFORMATIONSBEHANDLING); ISSN 0006-3835; SWE; DA. 1983; VOL. 23; NO 1; PP. 2-8; BIBL. 3 REF.Article

ON SPANNING TREES, WEIGHTED COMPOSITIONS, FIBONACCI NUMBERS, AND RESISTOR NETWORKS.MYERS BR.1975; S.I.A.M. REV.; U.S.A.; DA. 1975; VOL. 17; NO 3; PP. 465-474; BIBL. 4 REF.Article

PRIORITY QUEUES WITH UPDATE AND FINDING MINIMUM SPANNING TREES.JOHNSON DB.1975; INFORM. PROCESSG LETTERS; NETHERL.; DA. 1975; VOL. 4; NO 3; PP. 53-57; BIBL. 10 REF.Article

FINDING MINIMUM SPANNING TREES WITH A FIXED NUMBER OF LINKS AT A NODE.GLOVER F; KLINGMAN D.1975; IN: COMB. PROGRAMM. METHODS APPL. PROC. NATO ADV. STUDY INST.; VERSAILLES; 1974; DORDRECHT; D. REIDEL; DA. 1975; PP. 191-201; BIBL. 1 P.Conference Paper

AN ALGORITHM FOR DETERMINING THE TOPOLOGICAL DIMENSIONALITY OF POINT CLUSTERS.SCHWARTZMANN DH; VIDAL JJ.1975; I.E.E.E. TRANS. COMPUTERS; U.S.A.; DA. 1975; VOL. 24; NO 12; PP. 1175-1182; BIBL. 19 REF.Article